Bone alignment using the iterative closest point algorithm.

نویسندگان

  • Maarten Beek
  • Carolyn F Small
  • Randy E Ellis
  • Richard W Sellens
  • David R Pichora
چکیده

Computer assisted surgical interventions and research in joint kinematics rely heavily on the accurate registration of three-dimensional bone surface models reconstructed from various imaging technologies. Anomalous results were seen in a kinematic study of carpal bones using a principal axes alignment approach for the registration. The study was repeated using an iterative closest point algorithm, which is more accurate, but also more demanding to apply. The principal axes method showed errors between 0.35 mm and 0.49 mm for the scaphoid, and between 0.40 mm and 1.22 mm for the pisiform. The iterative closest point method produced errors of less than 0.4 mm. These results show that while the principal axes method approached the accuracy of the iterative closest point algorithm in asymmetrical bones, there were more pronounced errors in bones with some symmetry. Principal axes registration for carpal bones should be avoided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bounded iterative closest point method for minimally invasive registration of the femur.

This article describes a novel method for image-based, minimally invasive registration of the femur, for application to computer-assisted unicompartmental knee arthroplasty. The method is adapted from the well-known iterative closest point algorithm. By utilising an estimate of the hip centre on both the preoperative model and intraoperative patient anatomy, the proposed 'bounded' iterative clo...

متن کامل

Manual Alignment of CT and Ultrasound Images for Computer- Assisted Shoulder Arthroscopy

Many computer-assisted orthopaedic surgery applications employ a three-dimensional surface model of the anatomy of the patient for pre-operative planning. Registering the model to the coordinates of the patient in the operating room usually requires additional intra-operative images of the patient. To achieve accurate registration results using registration algorithms such as iterative closest ...

متن کامل

Fully automatic, robust and precise alignment of measured 3D surfaces for arbitrary orientations1)

We address the problem of Euclidean alignment of two partially overlapping surfaces represented by measured 3D point sets contaminated by noise and outliers. Recently, we have proposed the Trimmed Iterative Closest Point algorithm (TrICP) [3] which is fast, applicable to overlaps under 50% and robust to erroneous and incomplete measurements. In this study, we combine the precision and robustnes...

متن کامل

Marker-free Registration of Terrestrial Laser Scans Using the Normal Distribution Transform

The registration of scan data often uses special markers which are placed in the scene. This leads to a reliable registration but the method is not very efficient. Therefore, we search for a registration method which works without markers. There are methods like the iterative closest point (ICP) algorithm which calculate the registration on the basis of the data itself. However, these algorithm...

متن کامل

Robust Euclidean alignment of 3D point sets: the trimmed iterative closest point algorithm

The problem of geometric alignment of two roughly pre-registered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called Trimmed ICP. The new algorithm is based on the consistent use of the Least Trimmed Squares approach in all phases of the operation. Conver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of applied biomechanics

دوره 26 4  شماره 

صفحات  -

تاریخ انتشار 2010